A hierarchical, automated target recognition algorithm for a parallel analog processor

نویسندگان

  • Curtis Padgett
  • Gail Woodward
چکیده

A IIicrarcllical al)proacll is dcscrit.d for all autolt~atd target rccogtlitioll (A’J’1{) systcItI, VIG1l,AN’1’11}, that uses a Inassivc]y l)arallel, analog ]jrocessor (31) ANN). ‘J’lic 31) ANTNT l)rocessor is caI)ablc of Ixmforlning 64 com curwrlt, illncr I)roclucts of size IX409G every 250 llatloseco]lds. A colltIjlctc 64x64 raster scan of a 256x256 ittlage call be evaluated by tflc 31)ANNT wit}l its 64 ltlodifial~lc tetllplatcs in al)out 16 Iuilliscconcls. ‘1’0 fully utili7,c tl[c a[lalog I)rocessor a]id accon]~nodate its IIigll l)altdwidtlt rcquireltlcnts, tllc v e c t o r s (tern I)latcs) loadd oil to the 31)ANAT ]jrovidc climcllsionality rcduc(, ion for a hacli-cnd set of classifiers. ‘1’hc tc]ur)latcs used in the reported algoritllltl arc llicrarcllically gelwratcd sets of cigcllvcctors take]) froln a })artitiolid set of library object images. As itlforltlatiou is accuInulatd al)out tltc target (e.g. oljjcct class), a rnorc rdind set of ei.gmlvectors reflecting this kIIowldge call bc loadccl and IIlorc sl)ccializd classifiers utilized. ‘J’hc classifiers ~Jrovidc inforlnation related to tllc Al’l{ task: location, class, sul)-class, aI]d oricntatioIl of target(s). \\7c rel)ort some prcli Illinary results that cxaltlinc tllc ~mrfor]tlancc of orientation classifiers. \Vitfl no ktlowldgc aboltt object class 01 oriclltatio]l, a ]Ieut-al ]Ictlvork aclticvm 94 .2(X in detertniuirlg to wllicll OIIC of tflrcc classes froln wrt ical (30°, 45°, or 60° ) an ol~jcct ifllagc is cJriellted (+300). Using al I eigcllvector tcttll)latc set .gcv]eratd fro]]) a clistributio~l }vllerc bc~tll object class and oric]ltatic]ll are kHown, a neural llctwork classifier acllicvcs 96% in orict]ting the object to within +22,.5°. ‘1’ltis illfor~tlation catl bc used to load cvel) IItorc slwcific cigcllvcctor sets Jvllicll sl]oulcl lead to I[lorc accurate ot)ject locatiotl duri[lg tracking and an cnllatlccrnetlt itl ol)jcct rwogt]itiotl tasks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Effective Hybrid Genetic Algorithm for Hybrid Flow Shops with Sequence Dependent Setup Times and Processor Blocking

Hybrid flow-shop or flexible flow shop problems have remained subject of intensive research over several years. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of task processing. In many papers the assumptions are generally made that there is unlimited storage available between stages and the setup times a...

متن کامل

Parallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers

This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...

متن کامل

A Soft-Input Soft-Output Target Detection Algorithm for Passive Radar

Abstract: This paper proposes a novel scheme for multi-static passive radar processing, based on soft-input soft-output processing and Bayesian sparse estimation. In this scheme, each receiver estimates the probability of target presence based on its received signal and the prior information received from a central processor. The resulting posterior target probabilities are transmitted to the c...

متن کامل

Parallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm

This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...

متن کامل

A New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm

Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...

متن کامل

Face Detection with methods based on color by using Artificial Neural Network

The face Detection methodsis used in order to provide security. The mentioned methods problems are that it cannot be categorized because of the great differences and varieties in the face of individuals. In this paper, face Detection methods has been presented for overcoming upon these problems based on skin color datum. The researcher gathered a face database of 30 individuals consisting of ov...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997